An analysis of breadth-first beam search using uniform cost trees
نویسندگان
چکیده
In this paper, we present a probabilistic analysis of breadthfirst beam search on trees. The work is divided into two parts. First, we introduce a ranking model to characterize the nodes in a search space and discuss the condition for provable optimality of beam search in terms of the ranking model. We also formulate a method to compute the probability of optimal termination of beam search for a specific beam width. Next, we analyze the node expansion properties of beam search using a uniform cost tree model and establish a relationship between the probability of optimal termination and the search space configuration. The analysis explains certain interesting characteristics of beam search including the possibility of nonmonotonic progress with increasing search efforts.
منابع مشابه
Sequential Coding Algorithms: A Survey and Cost Analysis
Absrracr-The cost of a number of sequential coding search algorithms is analyzed in a systematic manner. These algorithms search code trees, and find use in data compression, error correction, and maximum likelihood sequence estimation. The cost function is made up of the size of and number of accesses to storage. It is found that algorithms that utilize sorting are much more expensive to use t...
متن کاملA appraisal paper on Breadth-first search, Depth-first search and Red black tree
Breadth-first and depth-first search are indispensable adventure strategies leading which many other rummage around algorithms are built. In this dissertation, we projected an loomed of integrating these two strategies in a solitary algorithm that combines the corresponding strengths of mutual. We account preliminary computational outcome using the tree width predicament as an example. This dis...
متن کاملAnalytical Results on the BFS vs . DFS Algorithm Selection Problem
Breadth-first search (BFS) and depth-first search (DFS) are the two most fundamental search algorithms. We derive approximations of their expected runtimes in complete trees, as a function of tree depth and probabilistic goal distribution. We also demonstrate that the analytical approximations are close to the empirical averages for most parameter settings, and that the results can be used to p...
متن کاملNon Uniform Rational B Spline (NURBS) Based Non-Linear Analysis of Straight Beams with Mixed Formulations
Displacement finite element models of various beam theories have been developed traditionally using conventional finite element basis functions (i.e., cubic Hermite, equi-spaced Lagrange interpolation functions, or spectral/hp Legendre functions). Various finite element models of beams differ from each other in the choice of the interpolation functions used for the transverse deflection w, tota...
متن کاملExperimental and finite-element free vibration analysis and artificial neural network based on multi-crack diagnosis of non-uniform cross-section beam
Crack identification is a very important issue in mechanical systems, because it is a damage that if develops may cause catastrophic failure. In the first part of this research, modal analysis of a multi-cracked variable cross-section beam is done using finite element method. Then, the obtained results are validated usingthe results of experimental modal analysis tests. In the next part, a nove...
متن کامل